Sparse graphs of girth at least five are packable
نویسندگان
چکیده
منابع مشابه
Sparse graphs of girth at least five are packable
A graph is packable if it is a subgraph of its complement. The following statement was conjectured by Faudree, Rousseau, Schelp and Schuster in 1981: every non-star graph G with girth at least 5 is packable. The conjecture was proved by Faudree et al. with the additional condition that G has at most 5n − 2 edges. In this paper, for each integer k ≥ 3, we prove that every non-star graphwith girt...
متن کاملExcluding Minors In Nonplanar Graphs Of Girth At Least Five
A graph is quasi 4-connected if it is simple, 3-connected, has at least five vertices, and for every partition (A, B, C) of V (G) either |C| ≥ 4, or G has an edge with one end in A and the other end in B, or one of A,B has at most one vertex. We show that any quasi 4-connected nonplanar graph with minimum degree at least three and no cycle of length less than five has a minor isomorphic to P− 1...
متن کاملAlgorithmic Search for Extremal Graphs of Girth At Least Five
Let f(v) denote the maximum number of edges in a graph of order v and of girth at least 5. In this paper, we discuss algorithms for constructing such extremal graphs. This gives constructive lower bounds of f(v) for v ≤ 200. We also provide the exact values of f(v) for v ≤ 24, and enumerate the extremal graphs for v ≤ 10.
متن کاملAltitude of regular graphs with girth at least five
The altitude of a graph G is the largest integer k such that for each linear ordering f of its edges, G has a (simple) path P of length k for which f increases along the edge sequence of P . We determine a necessary and sufficient condition for cubic graphs with girth at least five to have altitude three and show that for r 4, r-regular graphs with girth at least five have altitude at least fou...
متن کاملPlanar Graphs of Girth at least Five are Square (∆ + 2)-Choosable
We prove a conjecture of Dvořák, Král, Nejedlý, and Škrekovski that planar graphs of girth at least five are square (∆ + 2)-colorable for large enough ∆. In fact, we prove the stronger statement that such graphs are square (∆+2)-choosable and even square (∆+2)-paintable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.08.014